Three-regular path pairable graphs
نویسندگان
چکیده
A graph G with at least 2k vertices is k-path pairable if for any k pairs of distinct vertices 9f G there are k edge disjoint paths between the pairs. It will be shown for any positive integer k that there is a k-path pairable graph of maximum degree three.
منابع مشابه
Note on the diameter of path-pairable graphs
A graph on 2k vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have diameter of atmost 3. In this paperwe present an infinite family of path-pairable graphswith diameter d(G) = O( √ n) where n denotes the number of vertices of the graph. We prove that our example is extremal up to a con...
متن کاملOn the maximum diameter of path-pairable graphs
A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diameter of path-pairable graphs which either have a given number of edges, or are cdegenerate. Along the way we show that a large family of graphs obtained by blowing up a path is path-pairable, which may be of independent...
متن کاملOn the maximum degree of path-pairable planar graphs
A graph is path-pairable if for any pairing of its vertices there exist edge-disjoint paths joining the vertices in each pair. We investigate the behaviour of the maximum degree in path-pairable planar graphs. We show that any n-vertex path-pairable planar graph must contain a vertex of degree linear in n.
متن کاملPath-pairable Graphs
A graph of even order is called path-pairable, if for any pairing of its vertices, there exist edge disjoint paths connecting the paired vertices. Extrernal problerns for path-pairable graphs with restrictions on the maxirnurn degree will be considered. In particular, let f(n, k) denote the rninirrnun nurnber of edges in a path-pair able graph of order nand rnaxirnum degree k. Exact values of j...
متن کاملOn Path-pairability in the Cartesian Product
9 We study the inheritance of path-pairability in the Cartesian product of 10 graphs and prove additive and multiplicative inheritance patterns of path11 pairability, depending on the number of vertices in the Cartesian product. 12 We present path-pairable graph families that improve the known upper 13 bound on the minimal maximum degree of a path-pairable graph. Further 14 results and open que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 8 شماره
صفحات -
تاریخ انتشار 1992